Customer Selection and Profit Maximization in Vehicle Routing Problems

N P-hard problem as a total distance minimization problem. Natural extension of the notorious traveling salesperson problem (TSP) with… Delivery vehicles (homogeneous or heterogeneous fleet) have a limited capacity. One or more nodes in the graph (single depot vs. multi-depots) are designated as origins of routes. Each route should emanate from such an origin node. The rest of the nodes are identified as customer nodes. Each route terminates at its own origin (closed route), or either at a different origin (depot) or at a customer node (open route).